Closed Ziv–Lempel factorization of the m-bonacci words
نویسندگان
چکیده
A word w is said to be closed if it has a proper factor x which occurs exactly twice in w, as prefix and suffix of w. Based on the concept Ziv–Lempel factorization, we define z-factorization finite infinite words. Then find m-bonacci words for all m≥2. We also classify prefixes
منابع مشابه
Balances of m-bonacci Words
The m-bonacci word is a generalization of the Fibonacci word to the m-letter alphabet A = {0, . . . ,m − 1}. It is the unique fixed point of the Pisot–type substitution φm : 0 → 01, 1 → 02, . . . , (m − 2) → 0(m − 1), and (m − 1) → 0. A result of Adamczewski implies the existence of constants c such that the m-bonacci word is c-balanced, i.e., numbers of letter a occurring in two factors of the...
متن کاملDiffractive m-bonacci lenses.
Fibonacci zone plates are proving to be promising candidates in image forming devices. In this letter we show that the set of Fibonacci zone plates are a particular member of a new family of diffractive lenses which can be designed on the basis of a given m-bonacci sequence. These lenses produce twin axial foci whose separation depends on the m-golden mean. Therefore, with this generalization, ...
متن کاملAmbiguity in the m-Bonacci Numeration System
akGk, where ak ∈ N0, see for instance [8]. Some sequences (Gk)k∈N have even nicer property: Every positive integer can be expressed as a sum of distinct elements of the sequence (Gk)k∈N. The necessary and sufficient condition so that it is possible is that the sequence satisfies G1 = 1 and Gn −1 ≤ ∑n−1 i=1 Gi for all n ∈ N. Example of such a sequence is (2)k≥1 or (Fk)k≥1, the sequence of Fibona...
متن کاملClosed Factorization
A closed string is a string with a proper substring that occurs in the string as a prefix and a suffix, but not elsewhere. Closed strings were introduced by Fici (Proc. WORDS, 2011) as objects of combinatorial interest in the study of Trapezoidal and Sturmian words. In this paper we present algorithms for computing closed factors (substrings) in strings. First, we consider the problem of greedi...
متن کاملThe symmetric monoidal closed category of cpo $M$-sets
In this paper, we show that the category of directed complete posets with bottom elements (cpos) endowed with an action of a monoid $M$ on them forms a monoidal category. It is also proved that this category is symmetric closed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2022
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2022.03.019